Dependent sets of constant weight vectors in GF(q)
نویسنده
چکیده
We determine lower bounds for the number of random vectors in GF (q), chosen uniformly from vectors having k non-zero co-ordinates, needed to obtain a dependent set over GF (q).
منابع مشابه
The Fraction of Subspaces of GF ( q ) n with a Speci ed Numberof Minimal Weight Vectors is Asymptotically
The weight of a vector in the nite vector space GF(q) n is the number of nonzero components it contains. We show that for a certain range of parameters (n; j; k; w) the number of k-dimensional subspaces having j(q ? 1) vectors of minimum weight w has asymptotically a Poisson distribution with parameter = ? n w (q?1) w?1 q k?n. As the Poisson parameter grows, the distribution becomes normal.
متن کاملThe Fraction of Subspaces of GF ( q ) n with a Speci ed Numberof Minimal Weight Vectors is
The weight of a vector in the nite vector space GF(q) is the number of nonzero components it contains. We show that for a certain range of parameters (n; j; k;w) the number of k-dimensional subspaces having j(q 1) vectors of minimum weight w has asymptotically a Poisson distribution with parameter = n w (q 1) q . As the Poisson parameter grows, the distribution becomes normal. AMS-MOS Subject C...
متن کاملThe Fraction of Subspaces of GF(q) n with a Specified Number of Minimal Weight Vectors is Asymptotically Poisson
The weight of a vector in the finite vector space GF(q) is the number of nonzero components it contains. We show that for a certain range of parameters (n, j, k, w) the number of k-dimensional subspaces having j(q − 1) vectors of minimum weight w has asymptotically a Poisson distribution with parameter λ = ( n w ) (q−1)w−1qk−n. As the Poisson parameter grows, the distribution becomes normal. AM...
متن کاملConstructing two-weight codes with prescribed groups of automorphisms
We are interested in the construction of linear [n, k; q] two-weight codes. A linear code is a k−dimensional subspaceC of the n−dimensional vector spaceGF (q) over the finite fieldGF (q) with q elements. The q codewords of length n are the elements of the subspace, they are written as row vectors. The weight of a codeword c is the number of nonzero components of the vector c ∈ GF (q). In the ca...
متن کاملDependent Sets of Constant Weight Binary Vectors
We determine lower bounds for the number of random binary vectors, chosen uniformly from vectors of weight k, needed to obtain a dependent set.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 9 شماره
صفحات -
تاریخ انتشار 1996